Frame Based Typing of Predicate Transformers
نویسنده
چکیده
The algebraic relationship between predicates and predicate transformers is considered. A canonical decomposition property of transformers is used to develop a typing mechanism for predicate transformer process models based on the input and output interfaces of the processes. Predicate transformers are typed according to the variables read from or written to by the process described by the predicate transformer. This typing system is demonstrated on a small language for specifying dataaow processes.
منابع مشابه
Isomorphisms between Predicate and State Transformers
We study the relation between state transformers based on directed complete partial orders and predicate transformers. Concepts likèpredicate', `liveness', `safety' and`predicate transformers' are formulated in a topological setting. We treat state transformers based on the Hoare, Smyth and Plotkin powerdomains and consider continuous, monotonic and unrestricted functions. We relate the transfo...
متن کاملRelating Multifunctions and Predicate Transformers through Closure Operators
We study relations between predicate transformers and mul-tifunctions in a topological setting based on closure operators. We give topological deenitions of safety and liveness predicates and using these predicates we deene predicate transformers. State transformers are mul-tifunctions with values in the collection of xed points of a closure operator. We derive several isomorphisms between pred...
متن کاملIsomorphisms between Predicates and State Transformers
We study the relation between state transformers based on directed complete partial orders and predicate transformers. Concepts likèpredicate', `liveness', `safety' and`predicate transformers' are formulated in a topological setting. We treat state transformers based on the Hoare, Smyth and Plotkin power domains and consider continuous, monotonic and unrestricted functions. We relate the transf...
متن کاملGraph isomorphism models for non interleaving process algebra
Reduction and Topology, p. 28. Non Interleaving Process Algebra, p. 17. Design and Analysis of Dynamic Leader Election Protocols in Broadcast Networks, p. 73. A general conservative extension tbeorem in process algebra, p. 17. Job Shop Scheduling by Constraint Satisfaction, p. 22. A Hierarchical Membership Protocol for Synchronous Distributed Systems, p. 43. Temporal operators viewed as predica...
متن کاملUnderapproximating Predicate Transformers
We study the underapproximation of the predicate transformers used to give semantics to the modalities in dynamic and temporal logic. Because predicate transformers operate on state sets, we define appropriate powerdomains for sound approximation. We study four such domains — two are based on “set inclusion” approximation, and two are based on “quantification” approximation — and we apply the d...
متن کامل